A New Double Point Multiplication Method and its Implementation on Binary Elliptic Curves with Endomorphisms
نویسندگان
چکیده
Efficient and high-performance implementation of point multiplication is crucial for elliptic curve cryptosystems. In this paper, we present a new double point multiplication algorithm based on differential addition chains. We use our scheme to implement single point multiplication on binary elliptic curves with efficiently computable endomorphisms. Our proposed scheme has a uniform structure and has some degree of built-in resistance against side channel analysis attacks. We design a crypto-processor based on the proposed algorithm for double point multiplication and evaluate its area and time efficiency on FPGA. To the best of the authors’ knowledge, this is the first hardware implementation of single point multiplication (using double point multiplication) on elliptic curves with efficiently computable endomorphisms. Our analysis and timing results show that the expected acceleration in point multiplication is considerable. Prototypes of the proposed architectures are implemented and experimental results are presented.
منابع مشابه
A Comparison of Double Point Multiplication Algorithms and their Implementation over Binary Elliptic Curves
Efficient implementation of double point multiplication is crucial for elliptic curve cryptographic systems. We revisit three recently proposed simultaneous double point multiplication algorithms. We propose hardware architectures for these algorithms, and provide a comparative analysis of their performance. We implement the proposed architectures on Xilinx Virtex-4 FPGA, and report on the area...
متن کاملFaster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
The fundamental operation in elliptic curve cryptographic schemes is the multiplication of an elliptic curve point by an integer. This paper describes a new method for accelerating this operation on classes of elliptic curves that have efficiently-computable endomorphisms. One advantage of the new method is that it is applicable to a larger class of curves than previous such methods. For this s...
متن کاملCo-Z Addition Formulæ and Binary Ladders on Elliptic Curves
Meloni recently introduced a new type of arithmetic on elliptic curves when adding projective points sharing the same Z-coordinate. This paper presents further co-Z addition formulæ for various point additions on Weierstraß elliptic curves. It explains how the use of conjugate point addition and other implementation tricks allow one to develop efficient scalar multiplication algorithms making u...
متن کاملCo-Z Addition Formulæ and Binary Ladders on Elliptic Curves - (Extended Abstract)
Meloni recently introduced a new type of arithmetic on elliptic curves when adding projective points sharing the same Z-coordinate. This paper presents further co-Z addition formulæ (and register allocations) for various point additions on Weierstraß elliptic curves. It explains how the use of conjugate point addition and other implementation tricks allow one to develop efficient scalar multipl...
متن کاملImplementing 4-Dimensional GLV Method on GLS Elliptic Curves with j-Invariant 0
The Gallant-Lambert-Vanstone (GLV) method is a very efcient technique for accelerating point multiplication on elliptic curves with e ciently computable endomorphisms. Galbraith, Lin and Scott (J. Cryptol. 24(3), 446-469 (2011)) showed that point multiplication exploiting the 2-dimensional GLV method on a large class of curves over Fp2 was faster than the standard method on general elliptic cur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012